Cycle Covering
نویسندگان
چکیده
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the optical WDM network is a ring, there are requests between any pair of vertices and the covering is done with small cycles. This problem can be modelled as follows: Find a covering of the edges of a logical graph I (here the complete graph Kn) by subgraphs Ik of a certain kind (here cycles Ck of length k), such that, for each Ik, there exists in the physical graph G (here Cn) a disjoint routing of the edges of Ik. The aim is to minimize the number of subgraphs Ik in the covering. We give optimal solutions for that problem.
منابع مشابه
ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملThe Covering Radius of the Cycle Code of a Graph
SolC. P. and T. Zaslavsky, The covering radius of the cycle code of a graph, Discrete Applied Mathematics 45 (I 993) 63-70. The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We exploit a connection between the covering radius of this code and minimum T-joins. We obtain a lower bound on the covering radius which is met with equality when the graph is ...
متن کاملCycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a (1 + ln 2)-approximation for the lane covering problem [4, 5] in weighted graphs with metric lengths on the edges and an O(ln k) approximation for the bounded c...
متن کاملOn DRC - covering of ) ( nKt λ by cycles
This paper considers the cycle covering of complete multipartite graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of ) (n Kt λ , where V( Kt (n))=V(G), such that each cycle in the covering sati...
متن کاملOn DRC-covering of Kn by cycles
This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each other. The problem can be stated as follows : for a given graph G, find a cycle covering of the edge set of Kn, where V (Kn) = V (G), such that each cycle in the covering satisfies the disjoint ro...
متن کاملIsomorphism classes of cycle permutation graphs
Kwak, J.H. and J. Lee, Isomorphism classes of cycle permutation graphs, Discrete Mathematics 105 (1992) 131-142. In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycl...
متن کامل